منابع مشابه
Hard-Core Distributions for Somewhat Hard Problems
Consider a decision problem that cannot be 1 ? approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a fraction of instances. We show that for any such problem there is a speciic \hard-core" set of inputs which is at least a fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage ...
متن کاملMentoring mission leaders of the future. Program prepares laity for ministry leadership.
As religious sponsors increasingly relinquished their CEO positions throughout the 1980s and early 1990s, they established mission integration positions-staffed primarily by women religious-to help ensure the Catholic identity of their facilities. Now that role, too, is undergoing change as sponsors seek to empower the laity in their organizations with responsibility for carrying on the Church'...
متن کاملArtificial Intelligence Prepares for 2001
Artificial Intelligence, as a maturing scientific/engineering discipline, is beginning to find its niche among the variety of subjects that are relevant to intelligent, perceptive behavior. A view of AI is presented that is based on a declarative representation of knowledge with semantic attachments to problem-specific procedures and data structures. Several important challenges to this view ar...
متن کاملA Hard Convex Core Yukawa Equation of State for Nonassociated Chain Molecules
The compressibility factor of nonassociated chain molecules composed of hard convex core Yukawa segments was derived with SAFT-VR and an extension of the Barker-Henderson perturbation theory for convex bodies. The temperature-dependent chain and dispersion compressibility factors were derived using the Yukawa potential. The effects of temperature, packing fraction, and segment number on the com...
متن کاملHard-Core Bits for Proofs of Knowledge
For various well-known proofs of knowledge, we address the problem of how much information a cheating polynomial-time veriier can learn about individual bits of the prover's secret key. Speciically, under the widely believed assumption that the Schnorr identiication protocol is witness hiding, no polynomial-time veriier can distinguish the O(log k) most signiicant bits of the prover's secret ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Connections: The Quarterly Journal
سال: 2007
ISSN: 1812-1098
DOI: 10.11610/connections.06.3.09